Doubling the success of quantum walk search using internal-state measurements

Search via Quantum Walk

Quantum Walk Based Search Algorithms

In this survey paper we give an intuitive treatment of the discrete time quantization of classical Markov chains. Grover search and the quantum walk based search algorithms of Ambainis, Szegedy and Magniez et al. will be stated as quantum analogues of classical search procedures. We present a rather detailed description of a somewhat simplified version of the MNRS algorithm. Finally, in the que...

Quantum Random Walk via Classical Random Walk With Internal States

In recent years quantum random walks have garnered much interest among quantum information researchers. Part of the reason is the prospect that many hard problems can be solved efficiently by employing algorithms based on quantum random walks, in the same way that classical random walks have played a central role in many hugely successful randomized algorithms. In this paper we introduce a new ...

CHARACTERIZATION OF Si NANOSTRUCTURES USING INTERNAL QUANTUM EFFICIENCY MEASUREMENTS

Hemispherical reflectance and internal quantum efficiency measurements have been employed to evaluate the response of Si nanostructured surfaces formed by using random and periodic reactive ion etching techniques. Random RIE-textured surfaces have demonstrated solar weighted reflectance of= 3 ‘?XO over 3001200-nm spectral range even without the benefit of anti-reflection films. Random RIE-textu...

Optimized quantum random-walk search algorithms

Shenvi, Kempe and Whaley’s quantum random-walk search (SKW) algorithm [2003 Phys. Rev. A 67 052307] is known to require O( √ N) number of oracle queries to find the marked element, where N is the size of the search space. This scaling is thought to be the best achievable on a quantum computer. We prove that the final state of the quantum walk in the SKW algorithm yields the nearest neighbours o...